An Approximate Min-Sum Algorithm for Smart Grid Dispatch with Continuous Variables

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Optimal Approximate Dynamic Programming Algorithm for the Energy Dispatch Problem with Grid- Level Storage

We consider the problem of modeling hourly dispatch and energy allocation decisions in the presence of grid-level storage. The model makes it possible to capture hourly, daily and seasonal variations in wind, solar and demand, while also modeling the presence of hydroelectric storage to smooth energy production over both daily and seasonal cycles. The problem is formulated as a stochastic, dyna...

متن کامل

An Optimal Approximate Dynamic Programming Algorithm for the Economic Dispatch Problem with Grid-Level Storage

We prove convergence of an approximate dynamic programming algorithm for a class of highdimensional stochastic control problems linked by a scalar storage device. Our problem is motivated by the problem of optimizing hourly dispatch and energy allocation decisions in the presence of grid-level storage. The model makes it possible to capture hourly, daily and seasonal variations in wind, solar a...

متن کامل

Smart Grid Unit Commitment with Considerations for Pumped Storage Units Using Hybrid GA-Heuristic Optimization Algorithm

A host of technologies has been developed to achieve these aims of the smart grid. Some of these technologies include plug-in electric vehicle, demand response program, energy storage system and renewable distributed generation. However, the integration of the smart grid technologies in the power system operation studies such as economic emission unit commitment problem causes two major challen...

متن کامل

Online Algorithms for Sum-Product Networks with Continuous Variables

Sum-product networks (SPNs) have recently emerged as an attractive representation due to their dual interpretation as a special type of deep neural network with clear semantics and a tractable probabilistic graphical model. We explore online algorithms for parameter learning in SPNs with continuous variables. More specifically, we consider SPNs with Gaussian leaf distributions and show how to d...

متن کامل

Min-Sum Algorithm with Maximum Average Mutual Information Quantization

The specific methods of the maximum average mutual information quantization are analyzed and deduced. With this method to quantify the initial message, the variable messages and check messages are converted into integers. Then the min-sum decoding algorithm based on integer arithmetic is implemented. Simulation results demonstrate that the decoding performance of min-sum algorithm based on inte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IFAC-PapersOnLine

سال: 2016

ISSN: 2405-8963

DOI: 10.1016/j.ifacol.2016.10.709